Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
add > plus > [app2, s]
add > curry > [app2, s]
Status: curry: multiset
app2: [1,2]
plus: multiset
0: multiset
s: multiset
add: multiset